Nondeterministic finite automaton

Results: 144



#Item
41CS109B Notes for LectureAutomata Systems often may be modeled by a nite set of states.  The system is always in one state.

CS109B Notes for LectureAutomata Systems often may be modeled by a nite set of states.  The system is always in one state.

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:51
42Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2005-07-08 16:23:57
43IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO. 2, FEBRUARYFeedback Can Reduce the Specification Complexity of Motor Programs

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO. 2, FEBRUARYFeedback Can Reduce the Specification Complexity of Motor Programs

Add to Reading List

Source URL: hrl.harvard.edu

Language: English - Date: 2003-11-10 22:28:54
44Journal of Automata, Languages and Combinatorics u (v) w, x–y Otto-von-Guericke-Universit¨ at Magdeburg Regular Expressions: New Results and Open Problems

Journal of Automata, Languages and Combinatorics u (v) w, x–y Otto-von-Guericke-Universit¨ at Magdeburg Regular Expressions: New Results and Open Problems

Add to Reading List

Source URL: cs.uwaterloo.ca

Language: English - Date: 2011-06-09 07:59:48
45Greedy Regular Expression Matching Alain Frisch1,2,? and Luca Cardelli3 2 1 ´ Ecole Normale Sup´erieure (Paris)

Greedy Regular Expression Matching Alain Frisch1,2,? and Luca Cardelli3 2 1 ´ Ecole Normale Sup´erieure (Paris)

Add to Reading List

Source URL: www.cduce.org

Language: English - Date: 2013-12-06 16:18:28
46Honors Class (Foundations of) Informatics  Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci

Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2011-10-17 18:08:03
47Reasoning about XML with Temporal Logics and Automata Leonid Libkin Cristina Sirangelo  University of Edinburgh

Reasoning about XML with Temporal Logics and Automata Leonid Libkin Cristina Sirangelo University of Edinburgh

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-09-16 09:06:42
48Automata theory for XML researchers∗ Frank Neven University of Limburg   1

Automata theory for XML researchers∗ Frank Neven University of Limburg 1

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-07-04 06:02:40
49PII:

PII:

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-03-05 16:37:08
50MoChArt 2005 Preliminary Version  Incremental Verification for On-the-Fly Controller Synthesis David J. Musliner and Michael J. S. Pelican 1,2 Honeywell Laboratories

MoChArt 2005 Preliminary Version Incremental Verification for On-the-Fly Controller Synthesis David J. Musliner and Michael J. S. Pelican 1,2 Honeywell Laboratories

Add to Reading List

Source URL: rpgoldman.goldman-tribe.org

Language: English - Date: 2009-08-06 12:04:58